Computing the Approximate Convex Hull in High Dimensions
نویسندگان
چکیده
In this paper, an effective method with time complexity of O(K3/2N2 log K ǫ0 ) is introduced to find an approximation of the convex hull for N points in dimension n, where K is close to the number of vertices of the approximation. Since the time complexity is independent of dimension, this method is highly suitable for the data in high dimensions. Utilizing a greedy approach, the proposed method attempts to find the best approximate convex hull for a given number of vertices. The approximate convex hull can be a helpful substitute for the exact convex hull for on-line processes and applications that have a favorable trade off between accuracy and parsimony.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملConvex Hull in Higher Dimensions 1 Introduction
This lecture describes a data structure for representing convex polytopes and a divide and conquer algorithm for computing convex hull in 3 dimensions. Let S be a set of n points in . Convex hull of S (CH(S)) is the smallest convex polytope that contains all n points. Since the boundary of this polytope is planar, it can be efficiently represented by the data structure described in the next sec...
متن کاملLow-dimensional Embeddings for Interpretable Anchor-based Topic Inference
The anchor words algorithm performs provably efficient topic model inference by finding an approximate convex hull in a high-dimensional word co-occurrence space. However, the existing greedy algorithm often selects poor anchor words, reducing topic quality and interpretability. Rather than finding an approximate convex hull in a high-dimensional space, we propose to find an exact convex hull i...
متن کاملComputing Convex Hull in a Floating Point Arithmetic
We present a numerically stable and time and space complexity optimal algorithm for constructing a convex hull for a set of points on a plane. In contrast to already existing numerically stable algorithms which return only an approximate hull, our algorithm constructs a polygon that is truly convex. The algorithm is simple and easy to implement.
متن کاملL-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS
The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.04422 شماره
صفحات -
تاریخ انتشار 2016